منابع مشابه
Referring Expression Generation Challenge 2008 DIT System Descriptions (DIT-FBI, DIT-TVAS, DIT-CBSR, DIT-RBR, DIT-FBI-CBSR, DIT-TVAS-RBR)
This section describes the two systems developed at DIT for the attribute selection track of the REG 2008 challenge. Both of theses systems use an incremental greedy search to generate descriptions, similar to the incremental algorithm described in (Dale and Reiter, 1995). The output of these incremental algorithms are, to a large extent, determined by the order in which the algorithm tests the...
متن کاملSimple Computation of DIT FFT
FFT and IFFT algorithm plays an important role in design of digital signal processing. This paper describes the design of Decimation in Time-Fast Fourier Transform (DIT-FFT). The proposed design is a novel 16 bit word length processor, which is implemented with radix-2, based 8 point FFT. This approach reduces the multiplicative complexity which exists in conventional FFT implementation. For th...
متن کاملVers un modèle de diagnostic de compétence
The Lingot project is a multidisciplinary project that aims to support the management of the cognitive diversity of students in school algebra learning. In this paper, we focus on the research approach based on theoretical frameworks from Computer Science, Cognitive Ergonomics and Didactics of Mathematics. We present our research questions and a cognitive diagnosis tool we implemented. We propo...
متن کاملAsynchronous Rendez-vous in Distributed Logic Programming
In this paper the semantics of the communication mechanism of the distributed logic programming language DLP is studied. DLP combines logic programming with object oriented features and parallelism. For an abstract subset of DLP both an operational and denotational semantics is given. The language DLP supports active objects, method call by rendezvous and moreover (distributed) backtracking ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Meta
سال: 2002
ISSN: 1492-1421,0026-0452
DOI: 10.7202/004563ar